Instance Optimality of the Adaptive Maximum Strategy
نویسندگان
چکیده
In this paper, we prove that the standard adaptive finite element method with a (modified) maximum marking strategy is instance optimal for the total error, being the square root of the squared energy error plus the squared oscillation. This result will be derived in the model setting of Poisson’s equation on a polygon, linear finite elements, and conforming triangulations created by newest vertex bisection.
منابع مشابه
Economic Load Dispatch using PSO Algorithm Based on Adaptive Learning Strategy Considering Valve point Effect
Abstract: In recent years due to problems such as population growth and as a result increase in demand for electrical energy, power systems have been faced with new challenges that not existed in the past. One of the most important issues in modern power systems is economic load dispatch, which is a complex optimization problem with a large number of variables and constraints. Due to the comple...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملElectric Differential for an Electric Vehicle with Four Independent Driven Motors and Four Wheels Steering Ability Using Improved Fictitious Master Synchronization Strategy
Using an Electric Differential (ED) in electric vehicle has many advantages such as flexibility and direct torque control of the wheels during cornering and risky maneuvers. Despite its reported successes and advantages, the ED has several problems limits its applicability, for instance, an increment of control loops and an increase of computational effort. In this paper, an electric differenti...
متن کاملAn Adaptive Metaheuristic for the Simultaneous Resolution of a Set of Instances
Most of the adaptive metaheuristics face the resolution of an instance from scratch, without considering previous runs. Basing on the idea that the computational effort done and knowledge gained when solving an instance should be use to solve similar ones, we present a new metaheuristic strategy that permits the simultaneous solution of a group of instances. The strategy is based on a set of ad...
متن کاملCongestion estimation of router input ports in Network-on-Chip for efficient virtual allocation
Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 16 شماره
صفحات -
تاریخ انتشار 2016